Electing a Single Winner: Approval Voting in Practice
ثبت نشده
چکیده
It may come as a surprise to some that there is a science of elections, whose prov enance can be traced back to the Marquis de Condorcet in eighteenth-century France, Charles Dodgson (Lewis Carroll) in nineteenth-century England, and Kenneth Arrow in twentieth-century America. Since Arrow published his semi nal book, Social Choice and Individual Values, more than fifty years ago (Ar row, 1951, 1963)—for which in large part he received the Nobel Memorial Prize in Economics in 1972—there have been thousands of articles and hundreds of books published on everything from the mathematical properties of voting sys tems to empirical tests of the propensity of different systems to elect centrist candidates.1 The 2000 U.S. presidential election highlighted, among other things, the frailties of voting machines and the seeming arbitrariness of such venerable U.S. institutions as the Electoral College and the Supreme Court. Political com mentary has focused on these aspects but given very little attention to alterna tive voting systems, about which the science of elections has much to say. Several alternative systems for electing a single winner have been shown to be far superior to plurality voting (PV)—the most common voting system used in the United States as well as in many other places—in terms of a number of cri teria. PV, which allows citizens to vote for only one candidate, suffers from a dismaying flaw. In any race with more than two candidates, PV may elect the candidate least acceptable to the majority of voters. This frequently happens in a three-way contest, when the majority splits its votes between two centrist candi dates, enabling a candidate on the left or right to defeat both centrists. PV also
منابع مشابه
/an Experiment in Approval Voting
In its 1985 election for council The Institute of Management Sciences (TIMS) ran a test of approval voting by sending a non-binding approval ballot to its members along with the regular plurality ballot. In approval voting a person votes for (approves of) as many candidates as desired, the winner being the candidate with the most votes. Two of the TIMS contests had three candidates for a single...
متن کاملCritical Strategies Under Approval Voting: Who Gets Ruled In And Ruled Out
We introduce the notion of a “critical strategy profile” under approval voting (AV), which facilitates the identification of all possible outcomes that can occur under AV. Included among AV outcomes are those given by scoring rules, single transferable vote, the majoritarian compromise, Condorcet systems, and others as well. Under each of these systems, a Condorcet winner may be upset through m...
متن کاملWhen Voters Strategize, Approval Voting Elects Condorcet Winners but Condorcet Methods can Elect Condorcet Losers
We show that approval voting strategic equilibria are closely related to honest Condorcet Winners. There exists an approval equilibrium with a clear font-runner F and runner-up R if and only if the F is the clear Condorcet Winner and R the Condorcet runner-up. In contrast, we show that margins-based Condorcet methods can elect a Condorcet Loser with non-zero probibility when voters vote tactica...
متن کاملProportional Approval Method using Squared loads, Approval removal and Coin-flip approval transformation (PAMSAC) - a new system of proportional representation using approval voting
Several multi-winner systems that use approval voting have been developed but they each suffer from various problems. Six of these methods are discussed in this paper. They are Satisfaction Approval Voting, Minimax Approval Voting, Proportional Approval Voting, Monroe's Fully Proportional Representation, Chamberlin-Courant's Rule, and Ebert's method. They all fail at least one of Proportional R...
متن کاملComputational Aspects of Multi-Winner Approval Voting
We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional approval voting, and reweighted approval voting. We first show that computing the winner for proportional approval voting is NP-hard, closing a long standing open problem. As none of the rules are strategyproof, even for d...
متن کامل